#include <cstdio>
#include <algorithm>
#include <functional>
using namespace std;
const int N = 105;
int n, a[N];
int main() {
	scanf ("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf ("%d", &a[i]);
	}
	sort(a + 1, a + n + 1, greater<int>());
	for (int i = 1; i <= n; i++) {
		printf ("%d ", a[i]);
	}
	printf ("\n");
	return 0;
}
